Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
نویسندگان
چکیده
We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of classical semi-honest adversaries that we call specious. Our construction requires two ideal functionalities to garantee privacy: a private SWAP between registers held by the two parties and a classical private AND-box equivalent to oblivious transfer. If the unitary to be evaluated is in the Clifford group then only one call to SWAP is required for privacy. On the other hand, any unitary not in the Clifford requires one call to an AND-box per R-gate in the circuit. Since SWAP is itself in the Clifford group, this functionality is universal for the private evaluation of any unitary in that group. SWAP can be built from a classical bit commitment scheme or an AND-box but an AND-box cannot be constructed from SWAP. It follows that unitaries in the Clifford group are to some extent the easy ones. We also show that SWAP cannot be implemented privately in the bare model.
منابع مشابه
Actively Secure Two-Party Evaluation of Any Quantum Operation
We provide the first two-party protocol allowing Alice and Bob to evaluate privately even against active adversaries any completely positive, tracepreserving map F ∈ L(Ain ⊗ Bin) → L(Aout ⊗ Bout), given as a quantum circuit, upon their joint quantum input state ρin ∈ D(Ain ⊗ Bin). Our protocol leaks no more to any active adversary than an ideal functionality for F provided Alice and Bob have th...
متن کاملThe Quantum Cut-and-Choose Technique and Quantum Two-Party Computation
The application and analysis of the Cut-and-Choose technique in protocols secure against quantum adversaries is not a straightforward transposition of the classical case, among other reasons due to the difficulty to use “rewinding” in the quantum realm. We introduce a Quantum Computation Cut-and-Choose (QC-CC) technique which is a generalisation of the classical Cut-and-Choose in order to build...
متن کاملSpecious Adversaries and Quantum Private Information Retrieval
for QCRYPT 2013 contributed talk Ämin Baumeler ∗ and Anne Broadbent † Faculty of Informatics, Università della Svizzera italiana, Lugano, Switzerland Department of Combinatorics and Optimization & Institute for Quantum Computing University of Waterloo, Waterloo, Canada (Dated: June 19, 2013) Our contribution [2] is twofold. On the one hand, we show that information-theoretic single-server Quant...
متن کاملFully Simulatable Quantum-Secure Coin-Flipping and Applications
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented with quantum-computational security without any set-up assumptions, since our construction only assumes mixed commitment schemes which we show how to construct in the given setting. We then show that the interactive ge...
متن کاملFull Characterization of Completeness for Two-party Randomized Function Evaluation
We close a long line of work that has pursued a full characterization of completeness of (possibly randomized) finite functions for 2-party computation that is secure against active adversaries. The first such function was discovered almost quarter of a century back (Kilian, FOCS 1988). Since then the question of which all finite 2-party functions are complete has been studied extensively, lead...
متن کامل